Incremental Hyper-Sphere Partitioning for Classification
نویسندگان
چکیده
In this paper, an Incremental Hyper-Sphere Partitioning (IHSP) approach to classification on the basis of Incremental Linear Encoding Genetic Algorithm (ILEGA) is proposed. Hyper-spheres approximating boundaries to a given classification problem, are searched with an incremental approach based on a unique combination of genetic algorithm (GA), output partitioning and pattern reduction. ILEGA is used to cope with the difficulty of classification problems caused by the complex pattern relationship and curse of dimensionality. Classification problems are solved by a simple and flexible chromosome encoding scheme which is different from that was proposed in Incremental Hyper-plane Partitioning (IHPP) for classification. The algorithm is tested with 7 datasets. The experimental results show that IHSP performs better compared with those classified using hyper-planes and normal GA. Incremental Hyper-Sphere Partitioning for Classification
منابع مشابه
A PSO Based Incremental Hyper-Sphere Partitioning Approach to Classification
This paper proposes an incremental hyper-sphere partitioning approach for classification problems. Hyperspheres that are close to the classification boundaries of a given problem are searched using an incremental approach based upon Particle Swarm Optimization (PSO). This new algorithm is proposed to tackle the difficulty of classification problems caused by the complex pattern relationship wit...
متن کاملIncremental procedures for partitioning highly intermixed multi-class datasets into hyper-spherical and hyper-ellipsoidal clusters
Two procedures for partitioning large collections of highly intermixed datasets of different classes into a number of hyper-spherical or hyper-ellipsoidal clusters are presented. The incremental procedures are to generate a minimum numbers of hyper-spherical or hyper-ellipsoidal clusters with each cluster containing a maximum number of data points of the same class. The procedures extend the mo...
متن کاملEllipsoid ART and ARTMAP for Incremental Clustering and Classification
We introduce Ellipsoid-ART (EA) and Ellipsoid-ARTMAP (EAM) as a generalization of Hyper-sphere ART (HA) and Hypersphere-ARTMAP (HAM) respectively. As was the case with HMHAM, these novel architectures are based on ideas rooted in Fuzzy-ART (FA) and Fuuy-ARTMAP (FAM). While FMFAM aggregate input data using hyperrectangles, EA/EAM utilize hyper-ellipsoids for the same purpose. Due to their learni...
متن کاملEffective classification of 3D image data using partitioning methods
We propose partitioning-based methods to facilitate the classification of 3-D binary image data sets of regions of interest (ROIs) with highly non-uniform distributions. The first method is based on recursive dynamic partitioning of a 3-D volume into a number of 3-D hyper-rectangles. For each hyper-rectangle, we consider, as a potential attribute, the number of voxels (volume elements) that bel...
متن کاملData Partitioning for Incremental Data Mining
Data repositories of interest in data mining applications can be very large. Many of the existing learning algorithms do not scale up to extremely large data set. One approach to deal with this problem is to apply the concept of incremental learning. However, incremental data mining is not the same as incremental machine learning. The former handles one subset of data at a time, whereas the lat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJAEC
دوره 5 شماره
صفحات -
تاریخ انتشار 2014